Intersection Free Simplification
نویسندگان
چکیده
Triangle mesh decimation and multi-resolution techniques are widely used in visualization applications for huge scenes. A large collection of different simplification algorithms exists in order to build a multi-resolution model from a given triangle mesh. All of the existing approaches focus on the creation of a geometrically close approximation of the original model. In order to produce a simplified version of a model with close layers – such as dressed humans – self-intersections result in intolerable results. Even methods that allow the sewing of close surface parts lead to unpleasant self-intersections. Only the simplification envelops allow to completely prevent them. In this work we focus on the prevention and avoidance of self-intersection during simplication with vertex pair contractions. We examine the geomorph of the parametrized vertex pair contraction and detect collisions of the affected simplices. If no collision arises the operation cannot cause any new self-intersection. Otherwise we can simply discard the operation to prevent self-intersections as is done in the approach of simplification envelops. Our approach goes even further and tries to avoid the self-intersection by testing different target locations. This leads to better approximations as exhibited by a lower RMS and Hausdorff-distance. Furthermore our approach allows for arbitrary changes in the topology and garantees that geomorphs during progressive reception cannot cause self-intersections.
منابع مشابه
submitted to Shape Modeling Intersection Free Simplification
Triangle mesh decimation and multi-resolution techniques are widely used in visualization applications for huge scenes. A large collection of different simplification algorithms exists in order to build a multi-resolution model from a given triangle mesh. All of the existing approaches focus on the creation of a geometrically close approximation of the original model. In order to produce a simp...
متن کاملPoint-based Tetrahedral Mesh Simplification with Intersection-Free Surface Mesh Simplification
Simplification of tetrahedral meshes is an important tool to decrease the complexity of these datasets. Many visualization systems need the simplified version of a mesh to be fully interactive. This paper presents a rapid tetrahedral simplifier that works in three steps. First, the border of the tetrahedral mesh is simplified. Second, the interior of the mesh is point sampled such that the resu...
متن کاملOn cycles in intersection graphs of rings
Let $R$ be a commutative ring with non-zero identity. We describe all $C_3$- and $C_4$-free intersection graph of non-trivial ideals of $R$ as well as $C_n$-free intersection graph when $R$ is a reduced ring. Also, we shall describe all complete, regular and $n$-claw-free intersection graphs. Finally, we shall prove that almost all Artin rings $R$ have Hamiltonian intersection graphs. ...
متن کاملProgressive Hulls for Intersection Applications
Progressive meshes are an established tool for triangle mesh simplification. By suitably adapting the simplification process, progressive hulls can be generated which enclose the original mesh in gradually simpler, nested meshes. We couple progressive hulls with a selective refinement framework and use them in applications involving intersection queries on the mesh. We demonstrate that selectiv...
متن کاملMultiresolution Techniques for the Simplification of Triangular and Tetrahedral Meshes
We study the simplification of triangular and tetrahedral meshes using techniques based on successive edge collapses, as well as the exploitation of the generated multiple levels of detail for the effective processing of the models. Regarding triangular meshes, we present a method for the construction of progressive hulls, by suitable edge collapses; we use the generated hulls for the accelerat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- International Journal of Shape Modeling
دوره 9 شماره
صفحات -
تاریخ انتشار 2003